package com.tgy.algorithm.base._图;

import java.util.ArrayList;
import java.util.List;

public class Node {
    // 节点值
    public int value;
    // 入度
    public int in;
    // 出度
    public int out;
    // 从当前节点能到达的直接下一个Node
    public List<Node> nexts;
    // 当前节点连接的边
    public List<Edge> edges;

    public Node(int value){
        this.value = value;
        this.in = 0;
        this.out = 0;
        this.nexts = new ArrayList<>();
        this.edges = new ArrayList<>();
    }
}
